Implementation of a new matheuristic to solve the vehicle routing problem with simultaneous deliveries and pick-ups – VRPSPD

The objective of this article is to present a new methodology for solving the Homogeneous Vehicle Routing Problem with Simultaneous Pickups and Deliveries (VRPSPD). integrates matheuristic using Chu-Beasley genetic algorithm mixed integer linear programming, based on Branch-and-Bound procedure. best configuration obtained from improved through use constructive heuristic methods in determining sub-problems, which contribute creation initial population necessary stage local improvement. goal determine minimum-cost routes that satisfy pick-up delivery demands group geographically dispersed customers, while considering restrictions system number vehicles required. implemented C++ solver CPLEX software used find solution. Results test instances specialized literature demonstrate efficiency hybrid model, showing good results short computation times. This author's doctoral thesis engineering presents similar topics discussed international congresses, may explain similarities consulted bibliographical references.